Dyck path triangulations and extendability
نویسندگان
چکیده
منابع مشابه
Dyck path triangulations and extendability
We introduce the Dyck path triangulation of the cartesian product of two simplices ∆n−1×∆n−1. The maximal simplices of this triangulation are given by Dyck paths, and its construction naturally generalizes to produce triangulations of ∆rn−1 × ∆n−1 using rational Dyck paths. Our study of the Dyck path triangulation is motivated by extendability problems of partial triangulations of products of t...
متن کاملDyck path statistics
A wide range of articles dealing with the occurrence of strings in Dyck paths appear frequently in the literature [2], [3], [5], [6], [7] and [11]. A Dyck path of semilength n is a lattice path of N2 running from (0, 0) to (2n, 0), whose allowed steps are the up diagonal step (1, 1) and the down diagonal step (1,−1). These steps are called rise and fall respectively. It is clear that each Dyck ...
متن کاملEdge Proximity Conditions for Extendability in Planar Triangulations
A graph G with at least 2m + 2 vertices is said to be distance d m-extendable if for any matching M of G with m edges in which the edges lie pair-wise distance at least d, there exists a perfect matching of G containing M . In this paper we prove that every 5-connected triangulation on the plane of even order is distance 3 9-extendable and distance 4 m-extendable for any m.
متن کاملPath extendability of claw-free graphs
Let G be a connected, locally connected, claw-free graph of order n and x, y be two vertices of G. In this paper, we prove that if for any 2-cut S of G, S ∩ {x, y} = ∅, then each (x, y)-path of length less than n − 1 in G is extendable, that is, for any path P joining x and y of length h(<n− 1), there exists a path P ′ in G joining x and y such that V (P ) ⊂ V (P ′) and |P ′| = h+ 1. This gener...
متن کاملPath Planning in Triangulations
This paper presents in detail how the techniques described in my previous work [Kallmann et al., 2003] can be used for efficiently computing collision-free paths in a triangulated planar environment. The method is based on a dynamic Constrained Delaunay Triangulation (CDT) where constraints are the obstacles in the planar environment. The main advantage of relying on a triangulated domain is th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2015
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2014.10.009